Adaptive Routing in Communication Network Based on PS Table

In the literature we have studied each packet is routed along a possibly different path by using Back Pressure based adaptive routing algorithm. So there is poor delay performance and involve high implementation complexity. After studied Back Pressure algorithm with clearly, we have developed a new adaptive routing algorithm. Here we have designed probabilistic routing table that is used to route packets to per destination queue to decouple the routing and scheduling components of the algorithm. In the case of wireless networks the scheduling decisions are made using counters called shadow queues. The results are also extended to the case of networks that employ simple forms of network coding. In that case, our algorithm provides a low-complexity solution to optimally exploit the routing–coding tradeoff.